M. Jerrum: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

Improved approximation algorithms for MAXk-CUT and MAX BISECTION

A. Frieze, M. Jerrum

Journal:

Year:

1997

Language:

english

File:

PDF, 685 KB

english, 1997

2

Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers

Goldberg, Paul W., Jerrum, Mark R.

Journal:

Machine Learning

Year:

1995

Language:

english

File:

PDF, 1.08 MB

english, 1995

3

Inapproximability of the Tutte polynomial of a planar graph

Goldberg, Leslie Ann, Jerrum, Mark

Journal:

Computational Complexity

Year:

2012

Language:

english

File:

PDF, 515 KB

english, 2012

4

Constraint satisfaction problems and computational complexity

Journal:

Communications of the ACM

Year:

2010

Language:

english

File:

PDF, 93 KB

english, 2010

5

Generating and Counting Hamilton Cycles in Random Regular Graphs

Alan Frieze, Mark Jerrum, Michael Molloy, Robert Robinson, Nicholas Wormald

Journal:

Journal of Algorithms

Year:

1996

Language:

english

File:

PDF, 216 KB

english, 1996

6

Counting trees in a graph is #P-complete

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 469 KB

english, 1994

7

A compact representation for permutation groups

Journal:

Journal of Algorithms

Year:

1986

Language:

english

File:

PDF, 1.09 MB

english, 1986

8

Two-dimensional monomer-dimer systems are computationally intractable

Journal:

Journal of Statistical Physics

Year:

1987

Language:

english

File:

PDF, 665 KB

english, 1987

9

Two-dimensional monomer-dimer systems are computationally intractable

Journal:

Journal of Statistical Physics

Year:

1990

Language:

english

File:

PDF, 41 KB

english, 1990

10

The Swendsen–Wang Process Does Not Always Mix Rapidly

Vivek K. Gore, Mark R. Jerrum

Journal:

Journal of Statistical Physics

Year:

1999

Language:

english

File:

PDF, 144 KB

english, 1999

11

Approximate counting, uniform generation and rapidly mixing Markov chains

Alistair Sinclair, Mark Jerrum

Journal:

Information and Computation

Year:

1989

Language:

english

File:

PDF, 2.40 MB

english, 1989

12

Approximating the Permanent

Jerrum, Mark, Sinclair, Alistair

Journal:

SIAM Journal on Computing

Year:

1989

Language:

english

File:

PDF, 3.89 MB

english, 1989

13

Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers

Goldberg, Paul W., Jerrum, Mark R.

Journal:

Machine Learning

Year:

1995

Language:

english

File:

PDF, 1.06 MB

english, 1995

14

Counting, Sampling and Integrating: Algorithm and Complexity ||

Year:

2003

Language:

english

File:

PDF, 12.08 MB

english, 2003

15

[ACM Press the thirty-third annual ACM symposium - Hersonissos, Greece (2001..-..)] Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 - A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries

Jerrum, Mark, Sinclair, Alistair, Vigoda, Eric

Year:

2001

Language:

english

File:

PDF, 228 KB

english, 2001

16

A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

Jerrum, Mark, Sinclair, Alistair, Vigoda, Eric

Journal:

Journal of the ACM

Year:

2004

Language:

english

File:

PDF, 250 KB

english, 2004

17

An elementary analysis of a procedure for sampling points in a convex body

Russ Bubley, Martin Dyer, Mark Jerrum

Journal:

Random Structures & Algorithms

Year:

1998

Language:

english

File:

PDF, 257 KB

english, 1998

18

The complexity of finding minimum-length generator sequences

Journal:

Theoretical Computer Science

Year:

1985

Language:

english

File:

PDF, 1.56 MB

english, 1985

19

Random generation of combinatorial structures from a uniform distribution

Mark R. Jerrum, Leslie G. Valiant, Vijay V. Vazirani

Journal:

Theoretical Computer Science

Year:

1986

Language:

english

File:

PDF, 1.29 MB

english, 1986

20

Fast uniform generation of regular graphs

Mark Jerrum, Alistair Sinclair

Journal:

Theoretical Computer Science

Year:

1990

Language:

english

File:

PDF, 896 KB

english, 1990

21

A polynomial algorithm for deciding bisimilarity of normed context-free processes

Yoram Hirshfeld, Mark Jerrum, Faron Moller

Journal:

Theoretical Computer Science

Year:

1996

Language:

english

File:

PDF, 1.25 MB

english, 1996

22

The Metropolis algorithm for graph bisection

Mark Jerrum, Gregory B. Sorkin

Journal:

Discrete Applied Mathematics

Year:

1998

Language:

english

File:

PDF, 1.44 MB

english, 1998

23

The computational complexity of two-state spin systems

Leslie Ann Goldberg, Mark Jerrum, Mike Paterson

Journal:

Random Structures & Algorithms

Year:

2003

Language:

english

File:

PDF, 244 KB

english, 2003

24

Preface

Martin Dyer, Mark Jerrum, Peter Winkler

Journal:

Random Structures & Algorithms

Year:

2004

Language:

english

File:

PDF, 24 KB

english, 2004

25

The mixing time of Glauber dynamics for coloring regular trees

Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski

Journal:

Random Structures & Algorithms

Year:

2010

Language:

english

File:

PDF, 139 KB

english, 2010

26

Large Cliques Elude the Metropolis Process

Journal:

Random Structures & Algorithms

Year:

1992

Language:

english

File:

PDF, 715 KB

english, 1992

27

A very simple algorithm for estimating the number of k-colorings of a low-degree graph

Journal:

Random Structures & Algorithms

Year:

1995

Language:

english

File:

PDF, 498 KB

english, 1995

28

An analysis of a Monte Carlo algorithm for estimating the permanent

Alan Frieze, Mark Jerrum

Journal:

Year:

1995

Language:

english

File:

PDF, 849 KB

english, 1995

29

A Complexity Dichotomy For Hypergraph Partition Functions

Martin Dyer, Leslie Ann Goldberg, Mark Jerrum

Journal:

Computational Complexity

Year:

2010

Language:

english

File:

PDF, 609 KB

english, 2010

30

On the approximation of one Markov chain by another

Journal:

Probability Theory and Related Fields

Year:

2006

Language:

english

File:

PDF, 161 KB

english, 2006

31

The Relative Complexity of Approximate Counting Problems

Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill, Mark Jerrum

Journal:

Year:

2004

Language:

english

File:

PDF, 295 KB

english, 2004

32

Two Remarks Concerning Balanced Matroids

Journal:

Year:

2006

Language:

english

File:

PDF, 171 KB

english, 2006

33

An approximation trichotomy for Boolean #CSP

Martin Dyer, Leslie Ann Goldberg, Mark Jerrum

Journal:

Journal of Computer and System Sciences

Year:

2010

Language:

english

File:

PDF, 220 KB

english, 2010

34

Simple Translation-Invariant Concepts Are Hard to Learn

Journal:

Information and Computation

Year:

1994

File:

PDF, 529 KB

1994

35

A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language

Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Steve Mahaney

Journal:

Information and Computation

Year:

1997

Language:

english

File:

PDF, 360 KB

english, 1997

36

Counting and sampling H-colourings

Martin Dyer, Leslie Ann Goldberg, Mark Jerrum

Journal:

Information and Computation

Year:

2004

Language:

english

File:

PDF, 263 KB

english, 2004

37

Inapproximability of the Tutte polynomial

Leslie Ann Goldberg, Mark Jerrum

Journal:

Information and Computation

Year:

2008

Language:

english

File:

PDF, 366 KB

english, 2008

38

The complexity of weighted and unweighted #CSP

Andrei Bulatov, Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby

Journal:

Journal of Computer and System Sciences

Year:

2012

Language:

english

File:

PDF, 187 KB

english, 2012

39

Families of Fixed Degree Graphs for Processor Interconnection

Jerrum, M.R., Skyum, S.

Journal:

IEEE Transactions on Computers

Year:

1984

Language:

english

File:

PDF, 1.08 MB

english, 1984

40

Three-dimensional Statistical Data Security Problems

Irving, Robert W., Jerrum, Mark R.

Journal:

SIAM Journal on Computing

Year:

1994

Language:

english

File:

PDF, 1.49 MB

english, 1994

41

On Approximately Counting Colorings of Small Degree Graphs

Bubley, Russ, Dyer, Martin, Greenhill, Catherine, Jerrum, Mark

Journal:

SIAM Journal on Computing

Year:

1999

Language:

english

File:

PDF, 332 KB

english, 1999

42

Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers

Goldberg, Leslie Ann, Jerrum, Mark, Leighton, Tom, Rao, Satish

Journal:

SIAM Journal on Computing

Year:

1997

Language:

english

File:

PDF, 373 KB

english, 1997

43

An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks

Goldberg, Leslie Ann, Jerrum, Mark, MacKenzie, Philip D.

Journal:

SIAM Journal on Computing

Year:

1998

Language:

english

File:

PDF, 307 KB

english, 1998

44

An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings

Dyer, Martin, Goldberg, Leslie Ann, Greenhill, Catherine, Jerrum, Mark, Mitzenmacher, Michael

Journal:

SIAM Journal on Computing

Year:

2001

Language:

english

File:

PDF, 167 KB

english, 2001

45

Randomly Sampling Molecules

Goldberg, Leslie Ann, Jerrum, Mark

Journal:

SIAM Journal on Computing

Year:

2000

Language:

english

File:

PDF, 424 KB

english, 2000

46

Approximately Counting Hamilton Paths and Cycles in Dense Graphs

Dyer, Martin, Frieze, Alan, Jerrum, Mark

Journal:

SIAM Journal on Computing

Year:

1998

Language:

english

File:

PDF, 265 KB

english, 1998

47

Polynomial-Time Approximation Algorithms for the Ising Model

Jerrum, Mark, Sinclair, Alistair

Journal:

SIAM Journal on Computing

Year:

1993

Language:

english

File:

PDF, 3.75 MB

english, 1993

48

On Counting Independent Sets in Sparse Graphs

Dyer, Martin, Frieze, Alan, Jerrum, Mark

Journal:

SIAM Journal on Computing

Year:

2002

Language:

english

File:

PDF, 194 KB

english, 2002

49

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows

Cryan, Mary, Dyer, Martin, Goldberg, Leslie Ann, Jerrum, Mark, Martin, Russell

Journal:

SIAM Journal on Computing

Year:

2006

Language:

english

File:

PDF, 335 KB

english, 2006

50

A Complexity Dichotomy for Partition Functions with Mixed Signs

Goldberg, Leslie Ann, Grohe, Martin, Jerrum, Mark, Thurley, Marc

Journal:

SIAM Journal on Computing

Year:

2010

Language:

english

File:

PDF, 681 KB

english, 2010

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски